Approximation theory - PDFSEARCH.IO - Document Search Engine

Approximation theory
Results: 831

#	Item
341	Approximation Hardness of Graphic TSP on Cubic Graphs Marek Karpinski∗ Richard Schmied† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-04-25 00:45:46 NP-complete problems Operations research Combinatorial optimization Travelling salesman problem Cubic graph Hamiltonian path Gadget Degree Regular graph Graph theory Theoretical computer science Mathematics
342	Constant-Time Testing and Learning of Image Properties (full version) arXiv:1503.01363v2 [cs.DS] 6 MarPiotr Berman∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-08 21:15:52 Analysis of algorithms Computational complexity theory Approximation algorithms Property testing Time complexity Algorithm Randomized algorithm Theoretical computer science Applied mathematics Mathematics
343	Bandwidth Approximation of a Restricted Family of Trees Abstract Bandwidth is one of the canonical NP-complete problemsIt is NP-hard to approximate within any constant, even on treesGupta gave a randomized Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2009-12-02 23:05:21 NP-complete problems Tree Clique Path decomposition Graph coloring Graph theory Theoretical computer science Mathematics
344	Bandwidth Approximation of Many-Caterpillars Yuval Filmus September 1, 2009 Abstract Bandwidth is one of the canonical NPcomplete problems. It is NP-hard to approximate Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2009-12-02 23:07:07 Lepidoptera Polynomials Tree decomposition Approximation algorithm Caterpillar Polylogarithmic Theoretical computer science Graph theory Mathematics
345	The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-14 23:00:29 Complexity classes Mathematical optimization NP-complete problems Operations research Travelling salesman problem Algorithm Minimum spanning tree Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
346	An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs Jon Kleinberg ∗ Abstract Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2005-08-11 23:51:43 Tree Graph coloring Minor Path decomposition Planar separator theorem Graph theory Graph operations Planar graph
347	Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search Yuval Filmus and Justin Ward November 25, 2012 Abstract We present an optimal, combinatorial 1 − 1/e approximation algorithm for monotone s Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2012-11-25 12:04:59 Submodular set function Order theory Matroid Linear programming Greedy algorithm XTR Monotonic function Greedoid Ordinal optimization Mathematics Mathematical analysis Matroid theory
348	A 2.5 Factor Approximation Algorithm for the k-MST Problem Sunil Arya∗ H. Ramesh† Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:31:23 NP-complete problems Spanning tree Network theory Minimum spanning tree Shortest path problem Tree Graph Approximation algorithm Steiner tree problem Theoretical computer science Graph theory Mathematics
349	Syntactic Characterizations of Polynomial Time Optimization Classes Prabhu Manyem School of Information Technology and Mathematical Sciences University of Ballarat Mount Helen, VIC 3350, Australia. Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2008-07-15 06:05:48 Complexity classes Computational problems Operations research Optimization problem NP Approximation algorithms Mathematical optimization Time complexity Decision problem Theoretical computer science Computational complexity theory Applied mathematics
350	Syntactic Characterizations of Polynomial Time Optimization Classes Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-07-07 17:48:07 Computational problems Computational complexity theory Operations research Optimization problem Mathematical optimization Approximation algorithm NP Decision problem Polynomial-time approximation scheme Theoretical computer science Applied mathematics Complexity classes

UPDATE